An opportunistic and non-anticipating size-aware scheduling proposal for mean holding cost minimization in time-varying channels

نویسندگان

  • Ianire Taboada
  • Fidel Liberal
  • Peter Jacko
چکیده

In this paper we study how to design a scheduling strategy aimed at minimizing the average holding cost for flows with general size distribution when the feasible transmission rate of each user varies randomly over time. We employ a Whittle-index-based approach in order to achieve an opportunistic and nonanticipating size-aware scheduling index rule proposal. When the flow size distribution belongs to the Decreasing Hazard Rate class, we propose the so-called Attained Service Potential Improvement index rule, which consists in giving priority to the flows with the highest ratio between the current attainedservice-dependent completion probability and the expected potential improvement of this completion probability. We further analyze the performance of the proposed scheduler, concluding that it outperforms well-known opportunistic disciplines.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An inventory model for deteriorating items with time-dependent demand and time-varying holding cost under partial backlogging

In this paper, we considered a deterministic inventory model with time-dependent demand and time-varying holding cost where deterioration is time proportional. The model considered here allows for shortages, and the demand is partially backlogged. The model is solved analytically by minimizing the total inventory cost. The result is illustrated with numerical example for the model. The model ca...

متن کامل

Impact of Size-Based Scheduling on Flow Level Performance in Wireless Downlink Data Channels

We analyze the impact of size-based scheduling on the flow level performance of elastic traffic in wireless downlink data channels. The impact is assessed by comparing the flow level delay of the simple RR scheduler to two optimized non-anticipating schedulers (FB and FB◦) and SRPT. The optimized distance-aware scheduler FB◦ is derived by applying the Gittins index approach. Our results show th...

متن کامل

Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

متن کامل

A chance-constrained multi-objective model for final assembly scheduling in ATO systems with uncertain sub-assembly availability

A chance-constraint multi-objective model under uncertainty in the availability of subassemblies is proposed for scheduling in ATO systems. The on-time delivery of customer orders as well as reducing the company's cost is crucial; therefore, a three-objective model is proposed including the minimization of1) overtime, idletime, change-over, and setup costs, 2) total dispersion of items’ deliver...

متن کامل

Integrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment

Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Perform. Eval.

دوره 79  شماره 

صفحات  -

تاریخ انتشار 2014